Embeddings of λ-fold kite systems, λ ≥ 2
نویسندگان
چکیده
منابع مشابه
Small embeddings for partial triple systems of odd index
It has been conjectured that any partial triple system of order u and index λ can be embedded in a triple system of order v and index λ whenever v ≥ 2u + 1, λ(v − 1) is even and λ ( v 2 ) ≡ 0 (mod 3). This conjecture is known to hold for λ = 1 and for all even λ ≥ 2. Here the conjecture is proven for all remaining values of λ when u ≥ 28.
متن کاملOctagon Quadrangle Systems nesting 4-kite-designs having equi-indices
An octagon quadrangle is the graph consisting of an 8-cycle (x1, ..., x8) with two additional chords: the edges {x1, x4} and {x5, x8}. An octagon quadrangle system of order v and index λ [OQS] is a pair (X,B), where X is a finite set of v vertices and B is a collection of edge disjoint octagon quadrangles (called blocks) which partition the edge set of λKv defined on X. A 4-kite is the graph ha...
متن کاملAlgebraically Closed and Existentially Closed Substructures in Categorical Context
We investigate categorical versions of algebraically closed (= pure) embeddings, existentially closed embeddings, and the like, in the context of locally presentable categories. The definitions of S. Fakir [Fa, 75], as well as some of his results, are revisited and extended. Related preservation theorems are obtained, and a new proof of the main result of Rosický, Adámek and Borceux ([RAB, 02])...
متن کاملUnit commitment by a fast and new analytical non-iterative method using IPPD table and “λ-logic” algorithm
Many different methods have been presented to solve unit commitment (UC) problem in literature with different advantages and disadvantages. The need for multiple runs, huge computational burden and time, and poor convergence are some of the disadvantages, where are especially considerable in large scale systems. In this paper, a new analytical and non-iterative method is presented to solve UC p...
متن کاملExistentially Closed BIBD Block-Intersection Graphs
A graph G with vertex set V is said to be n-existentially closed if, for every S ⊂ V with |S| = n and every T ⊆ S, there exists a vertex x ∈ V − S such that x is adjacent to each vertex of T but is adjacent to no vertex of S − T . Given a combinatorial design D with block set B, its block-intersection graph GD is the graph having vertex set B such that two vertices b1 and b2 are adjacent if and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 36 شماره
صفحات -
تاریخ انتشار 2006